Recursion over realizability structures
نویسندگان
چکیده
منابع مشابه
Recursion over Realizability Structures
Realizability structures play a major role in the metamathematics of intuitionistic systems and they are a basic tool in the extraction of the computational content of constructive proofs. Besides their rich categorical structure and effectiveness properties provide a privileged mathematical setting for the semantics of data types of programming languages. In this paper we emphasize the modelli...
متن کاملComputability structures, simulations and realizability
We generalize the standard construction of realizability models (specifically, of categories of assemblies) to a wide class of computability structures, broad enough to embrace models of computation such as labelled transition systems and process algebras. We consider a general notion of simulation between such computability structures, and show how these simulations correspond precisely to cer...
متن کاملRecursion on Abstract Structures
We develop and compare two models for computability over an abstract structure. The first, characterized in term of generalized register machines, provides a good theory for a large class of first-order structures. The second, defined in terms of minimal solutions for functional equations, is more versatile and handles many common second-order examples.
متن کاملNominal Structures and Structural Recursion
It is possible within Tree Adjoining Grammar to reproduce many of the syntactic analyses originally formulated by linguists in transformational terms. To the extent that these analyses are well-motivated empirically, this fact makes TAG interesting for use in developing computational learning and processing models (Joshi 1990, Frank 1992, Rambow 1994), since the use of other non-transformationa...
متن کاملStructural Recursion over Contextual Objects
A core programming language is presented that allows structural recursion over open LF objects and contexts. The main technical tool is a coverage checking algorithm that also generates valid recursive calls. Termination of call-byvalue reduction is proven using a reducibility semantics. This establishes consistency and allows the implementation of proofs about LF specifications as well-founded...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90074-c